On Discrete Chamber-transitive Automorphism Groups of Affine Buildings

نویسندگان

  • W. M. KANTOR
  • R. A. LIEBLER
چکیده

1. Introduction. Let A be the affine building of a simple adjoint algebraic group Q of relative rank > 2 over a locally compact local field K. Let Aut A (resp. E Aut A) denote the group of type-preserving (resp. of all) auto-morphisms of A. Note that E Aut A contains the group $(K) of ÜT-rational points of §. We will be interested in discrete subgroups of Aut A which are chamber-transitive on A. It is extremely rare that such groups exist and, as can therefore be expected, exceptions are interesting phenomena; our purpose is to list them all (see the theorem below). In order to describe them we must first introduce some notation. Let ƒ be a quadratic form in n variables over Q p with coefficients in Z. We let Pfi(/, Z[l/p]) denote the intersection PSO(/, Q p)'nPGL(n, Z[l/p]) within PGL(n,Q p), and similarly PGO(/, Z[l/p]) = PGO(/,Q p) nPGL(n,Z[l/p]). In the following list, T will always be a chamber-transitive subgroup of Aut A. The fundamental quadratic form (over Z) of the root lattice of type A n , B n , E n , normalized so that the long roots have squared length 2, will be denoted by a n ,6 n ,e n , respectively; note that b n is Yl" x l-(i) Let ƒ = eg, &7,ci6,66*^6* or as, and let A be the affine building of PSO(/,Q 2). Here T can be any group between r min = Pfi(/,Z[l/2]) and r ma x = PGO(/,Z[l/2]) fi Aut A. The quotient r max /r min is elementary abelian of order 1, 1, 1, 4, 2, or 2, respectively, and r max is generated by Train and reflections. (ii) Let ƒ = &5,e6, or b' e = Xa x ? + ^ x h an(l let A be the building of PSO(/,Q 3). The group r max (/) = PGO(/, Z[l/3]) n Aut A has 3, 5, or 9 conjugacy classes of chamber-transitive subgroups T. Passage mod 2 maps r m ax(b5) onto the symmetric group S5, and the preimages in r max (&5) of S5, A5, or a group of order 20 form the 3 desired conjugacy classes of groups T. The forms e& and b' e are rationally equivalent, and hence the buildings they define over Q3 are the "same" ; with suitable identifications of buildings and groups, T b = r max (ee) …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Exceptional 2-Adic Buildings

Tits [ 191 has initiated the study of geometries having properties strongly resembling those of buildings (compare [6]). His main result is that, in general, such a geometry is the image of a building under a suitable type of morphism. These geometries that are almost buildings were called GABS in [lo], and finite examples were described in [2, 8, 10, 15, 161 that are not buildings but have hig...

متن کامل

Difference sets and doubly transitive actions on Hadamard matrices

Non-affine groups acting doubly transitively on a Hadamard matrix have been classified by Ito. Implicit in this work is a list of Hadamard matrices with non-affine doubly transitive automorphism group. We give this list explicitly, in the process settling an old research problem of Ito and Leon. We then use our classification to show that the only cocyclic Hadamard matrices developed form a dif...

متن کامل

3-Homogeneous Groups and Block-Transitive 7–(v, k, 3) Designs

The classification of a block-transitive designs is an important subject on algebraic combinatorics. With the aid of MATLAB software, using the classification theorem of 3-homogeneous permutation groups, we look at the classification problem of block-transitive 7–(v, k, 3) design and prove our main theorem: If the automorphism group of a 7–(v, k, 3) design is block-transitive, then it is neithe...

متن کامل

The automorphism groups of non-edge-transitive rose window graphs

In this paper, we will determine the full automorphism groups of rose window graphs that are not edge-transitive. As the full automorphism groups of edge-transitive rose window graphs have been determined, this will complete the problem of calculating the full automorphism group of rose window graphs. As a corollary, we determine which rose window graphs are vertex-transitive. Finally, we deter...

متن کامل

On primitivity and reduction for flag-transitive symmetric designs

We present some results on flag-transitive symmetric designs. First we see what conditions are necessary for a symmetric design to admit an imprimitive, flag-transitive automorphism group. Then we move on to study the possibilities for a primitive, flag-transitive automorphism group, and prove that for λ ≤ 3, the group must be affine or almost simple, and finally we analyse the case in which a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007